منابع مشابه
q-Distributions on boxed plane partitions
We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon’s product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of these weights that are related to orthogonal polynomials; they form three two-dimensional families. For distributions from these families we prove two types...
متن کاملGibbs distributions for random partitions generated by a fragmentation process
In this paper we study random partitions of {1, . . . , n} where every cluster of size j can be in any of wj possible internal states. The Gibbs (n, k, w) distribution is obtained by sampling uniformly among such partitions with k clusters. We provide conditions on the weight sequence w allowing construction of a partition valued random process where at step k the state has the Gibbs (n, k, w) ...
متن کاملSome Results on Equilibrium Distributions
The equilibrium distributions have many applications in reliability theory, stochastic orderings and random processes. The purpose of this paper is to introduce the equilibrium distributions and presents some results related to this issue. Some results are based on order statistics. In this paper, the generalized Pareto distributions are also analyzed and some basic relationships between t...
متن کامل2 A pr 1 99 9 DISTRIBUTIONS ON PARTITIONS , POINT PROCESSES , AND THE HYPERGEOMETRIC KERNEL
We study a 3–parametric family of stochastic point processes on the one–dimensional lattice originated from a remarkable family of representations of the infinite symmetric group. We prove that the correlation functions of the processes are given by determinantal formulas with a certain kernel. The kernel can be expressed through the Gauss hypergeometric function; we call it the hypergeometric ...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1987
ISSN: 0090-5364
DOI: 10.1214/aos/1176350604